Space-Efficient Fully Dynamic DFS in Undirected Graphs †
نویسندگان
چکیده
منابع مشابه
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
Given an undirected graph G = (V, E) on n vertices and m edges, we address the problem of maintaining a DFS tree when the graph is undergoing updates (insertion and deletion of vertices or edges). We present the following results for this problem. 1. Fault tolerant DFS tree: There exists a data structure of size˜O(m) 1 such that given any set F of failed vertices or edges, a DFS tree of the gra...
متن کاملImproved Algorithms for Maintaining DFS Tree in Undirected Graphs
Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph G = (V,E) with n vertices and m edges, the textbook algorithm takes O(n + m) time to construct a DFS tree. In this paper, we study the problem of maintaining a DFS tree when the graph is undergoing updates. Formally, we show the following results. • Inc...
متن کاملDynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier
Depth first search (DFS) tree is a fundamental data structure for solving various problems in graphs. It is well known that it takes O(m+ n) time to build a DFS tree for a given undirected graph G = (V,E) on n vertices and m edges. We address the problem of maintaining a DFS tree when the graph is undergoing updates (insertion and deletion of vertices or edges). We present the following results...
متن کاملIncremental Algorithm for Maintaining DFS Tree for Undirected Graphs
Depth First Search (DFS) tree is a fundamental data structure for graphs used in solving various algorithmic problems. However, very few results are known for maintaining DFS tree in a dynamic environment insertion or deletion of edges. The only non-trivial result for this problem is by Franciosa et al. [4]. They showed that, for a directed acyclic graph on n vertices, a DFS tree can be maintai...
متن کاملOn Dynamic DFS Tree in Directed Graphs
Let G = (V,E) be a directed graph on n vertices and m edges. We address the problem of maintaining a depth first search (DFS) tree efficiently under insertion/deletion of edges in G. 1. We present an efficient randomized decremental algorithm for maintaining a DFS tree for a directed acyclic graph. For processing any arbitrary online sequence of edge deletions, this algorithm takes expected O(m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12030052